一类三角剖分下样条空间S_3~1(Δ)维数

首次提出了一种判别样条空间S13(Δ)维数不依赖剖分几何性质的协调条件·　依此 ,在一类较一般的三角剖分下 ,获得了S13(Δ)的维数·     

BaY2F8晶体生长基元与结晶机理的探讨

本文通过对BaY2F8晶体结构的分析,从晶体的生长基元为负离子配位多面体理论出发,对自然冷却条件下BaY2F8晶体自发结晶习性进行了研究,提出了以Ba2+为中心的近八配位十二面体和以Y3+为中心的近八配位十二面体是晶体生长的基元.并根据自发结晶的BaY2F8的XRD,说明了BaY2F8晶体的{200}、{130}、{021}、{330}、{-111}、{111}、{221}、{002}等面族比较发育的原因.本文证实了仲维卓的负离子配位多面体理论对BaY2F8晶体生长的适用性,并对探索新的BaY2F8单晶生长方法有参考作用.     

纳米晶粒取向连生与枝蔓晶的形成

本文研究了在水热条件下ZnO、BaTiO3、La2/3TiO3和Fe2O3纳米晶粒的取向连生和枝蔓晶的形成.用负离子配位多面体生长基元理论模型讨论了纳米晶粒的取向连生和晶粒相连的枝蔓晶,其枝蔓晶的形成与通常枝蔓晶的形成机理是一致的,都是沿着晶体中负离子配位多面体相互联结的稳定方向,为晶体生长速率最快方向,其分布的对称性与晶体结构的对称性是对应一致的.     

空间编码与灰度投影相结合实现高效3-D形貌测量的研究

介绍了一种结合空间编码与灰度投影来实现高效三维形貌测量的方法。用空间编码完成对被测空间的粗略编码,用灰度投影完成精确编码,将它们结合起来得到被测物体表面丰富的编码信息,作为一种基于三角法的三维形貌测量方法,能够在物体表面非常不连续和外部光照造成的背景光强分布不确定的情况下工作良好。同时,与传统的空间编码方法相比,它大大提高了空间编码的效率。实验表明,该方法用５ 幅图像取得了与灰度码１０幅图像相当的测量结果。     

柏拉图多面体与高碳原子簇

在简要分析柏拉图多面体的对称性质和几何特性的基础上,讨论了它与一般高对称性原子簇的分子骨架几何构型,特别是它与高对称性高碳原子簇几何构型之间的关系.     

基于空间二进制编码的3 D形貌测量方法

介绍了一种基于空间二进制编码的非接触３ Ｄ 形貌测量方法。它用一台ＬＣＤ 投影仪对被测物体表面进行空间编码,再用一台ＣＣＤ 摄像机获取物体编码信息,最后用三角法原理从摄像机图像中获取三维形貌数据。提出了基于三角法的空间二进制码的重要特性,描述了高效编码的构造方法。用这个构造方法构造出一个完全数字化的７ 位字长的二进制编码。基于这种编码的３ Ｄ 形貌测量方法在被测物体表面非常不连续和非构造的环境下取得了良好的测量结果。     

On Potential Theoretic Skeletons of Polyhedra

We prove that any polyhedron in two dimensions admits a type of potential theoretic skeleton called mother body. We also show that the mother bodies of any polyhedron in any number of dimensions are in one-to-one correspondence with certain kinds of decompositions of the polyhedron into convex subpolyhedra. A consequence of this is that there can exist at most finitely many mother bodies of any given polyhedron. The main ingredient in the proof of the first mentioned result consists of showing that any polyhedron in two dimensions contains a convex subpolyhedron which sticks to it in the sense that every face of the subpolyhedron has some part in common with a face of the original polyhedron.     

Computing a Minimum Weight Triangulation of a Sparse Point Set*

Investigating the minimum weight triangulation of a point set with constraint is an important approach for seeking the ultimate solution of the minimum weight triangulation problem. In this paper, we consider the minimum weight triangulation of a sparse point set, and present an O(n ⁴) algorithm to compute a triangulation of such a set. The property of sparse point set can be converted into a new sufficient condition for finding subgraphs of the minimum weight triangulation. A special point set is exhibited to show that our new subgraph of minimum weight triangulation cannot be found by any currently known methods.     

Representation of torus homeotopies by simple polyhedra with boundary

In 1991, Turaev and Viro constructed a quantum topological linear representation of mapping class groups of closed surfaces. To the mappings of a surface into itself, they assigned simple polyhedra whose boundaries consisted of two simple graphs cutting the surface into cells. The computational complexity of the Turaev-Viro representations strongly depends on the choice of suitable sets of simple polyhedra. In this paper, simple polyhedra for the torus are constructed. One of the reasons why they are convenient is that they all are obtained by gluing along boundary of copies of the same simple polyhedron. Translated fromMatematicheskie Zametki, Vol. 66, No. 4, pp. 533–539, October, 1999.